首页> 外文OA文献 >The fluid flow approximation of the TCP vegas and reno congestion control mechanism
【2h】

The fluid flow approximation of the TCP vegas and reno congestion control mechanism

机译:TCP vegas和reno拥塞控制机制的流体流量近似

代理获取
本网站仅为用户提供外文OA文献查询和代理获取服务,本网站没有原文。下单后我们将采用程序或人工为您竭诚获取高质量的原文,但由于OA文献来源多样且变更频繁,仍可能出现获取不到、文献不完整或与标题不符等情况,如果获取不到我们将提供退款服务。请知悉。

摘要

TCP congestion control algorithms have been design to improve Internet transmission performance and stability. In recent years the classic Tahoe/Reno/NewReno TCP congestion control, based on losses as congestion indicators, has been improved and many congestion control algorithms have been proposed. In this paper the performance of standard TCP NewReno algorithm is compared to the performance of TCP Vegas, which tries to avoid congestion by reducing the congestion window (CWND) size before packets are lost. The article uses fluid flow approximation to investigate the influence of the two above-mentioned TCP congestion control mechanisms on CWND evolution, packet loss probability, queue length and its variability. Obtained results show that TCP Vegas is a fair algorithm, however it has problems with the use of available bandwidth.
机译:已经设计了TCP拥塞控制算法来提高Internet传输性能和稳定性。近年来,基于损耗作为拥塞指标的经典Tahoe / Reno / NewReno TCP拥塞控制已得到改进,并提出了许多拥塞控制算法。在本文中,将标准TCP NewReno算法的性能与TCP Vegas的性能进行了比较,后者试图通过在丢失数据包之前减小拥塞窗口(CWND)大小来避免拥塞。本文使用流体流量近似来研究上述两种TCP拥塞控制机制对CWND演进,丢包概率,队列长度及其可变性的影响。所得结果表明,TCP Vegas是一种公平的算法,但是它在使用可用带宽方面存在问题。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
代理获取

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号